Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
نویسندگان
چکیده
منابع مشابه
Finding Single Track Gray Codes with SAT
Binary Codes are used in channel encodings, but also for encoding positions that can be decoded by sensors. These binary codes can be constructed, however, a code can also be found by searching a solution for a given specification. The paper presents how to specify codes for gray codes and single track gray codes, similar to [1].
متن کاملUsing SAT Solvers for Industrial Combinatorial Problems
SAT solving is the task of checking whether a given propositional logic formula has a solution, i. e., if there exists an assignment to all Boolean variables s. t. the whole formula is satis ed. As a lot of problems can be easily encoded into propositional logic, SAT solving is a general purpose approach which can be used in many di erent areas. In this thesis we consider the application of SAT...
متن کاملBinary Gray Codes with Long Bit Runs
We show that there exists an n-bit cyclic binary Gray code all of whose bit runs have length at least n − 3 log2 n. That is, there exists a cyclic ordering of {0, 1}n such that adjacent words differ in exactly one (coordinate) bit, and such that no bit changes its value twice in any subsequence of n − 3 log2 n consecutive words. Such Gray codes are ‘locally distance preserving’ in that Hamming ...
متن کاملComputing Maximum Unavoidable Subgraphs Using SAT Solvers
Unavoidable subgraphs have been widely studied in the context of Ramsey Theory. The research in this area focuses on highly structured graphs such as cliques, cycles, paths, stars, trees, and wheels. We propose to study maximum unavoidable subgraphs measuring the size in the number of edges. We computed maximum unavoidable subgraphs for graphs up to order nine via SAT solving and observed that ...
متن کاملAnalysis of Computing Policies Using SAT Solvers
A computing policy is a sequence of rules, where each rule consists of a predicate and a decision, and where each decision is either “accept” or “reject”. A policy P is said to accept (or reject, respectively) a request if and only if the decision of the first rule in P , that matches the request is “accept” (or “reject”, respectively). Examples of computing policies are firewalls, routing poli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2008
ISSN: 0018-9448
DOI: 10.1109/tit.2008.917695